Homological connectivity of random k-dimensional complexes
نویسندگان
چکیده
Let ∆n−1 denote the (n − 1)-dimensional simplex. Let Y be a random k-dimensional subcomplex of ∆n−1 obtained by starting with the full (k − 1)-dimensional skeleton of ∆n−1 and then adding each k-simplex independently with probability p. Let Hk−1(Y ;R) denote the (k−1)-dimensional reduced homology group of Y with coefficients in a finite abelian group R. It is shown that for any fixed R and k ≥ 1 and for any function ω(n) that tends to infinity lim n→∞ Pr [ Hk−1(Y ;R) = 0 ] = { 0 p = k logn−ω(n) n 1 p = k logn+ω(n) n
منابع مشابه
Homological Connectivity Of Random 2-Complexes
Let ∆n−1 denote the (n−1)-dimensional simplex. Let Y be a random 2-dimensional subcomplex of ∆n−1 obtained by starting with the full 1-dimensional skeleton of ∆n−1 and then adding each 2−simplex independently with probability p. Let H1(Y ; F2) denote the first homology group of Y with mod 2 coefficients. It is shown that for any function ω(n) that tends to infinity lim n→∞ Prob [ H1(Y ; F2) = 0...
متن کاملA configuration of homological stability results
This thesis has two purposes. The first is to serve as an introductory survey to the study of homological stability in algebraic topology. Particular focus is given to the study of configuration spaces and all the topics that we discuss will be related to them in some way. We prove homological stability theorems and use homological stability to answer questions from other fields of mathematics....
متن کاملThe Mumford conjecture, Madsen-Weiss and homological stability for mapping class groups of surfaces
The Mumford conjecture, Madsen-Weiss and homological stability for mapping class groups of surfaces 3 Introduction 3 Lecture 1. The Mumford conjecture and the Madsen-Weiss theorem 5 1. The Mumford conjecture 5 2. Moduli space, mapping class groups and diffeomorphism groups 5 3. The Mumford-Morita-Miller classes 7 4. Homological stability 7 5. The Madsen-Weiss theorem 9 6. Exercices 10 Lecture 2...
متن کاملOn a lower bound for the connectivity of the independence complex of a graph
Aharoni, Berger and Ziv proposed a function which is a lower bound for the connectivity of the independence complex of a graph. They conjectured that this bound is optimal for every graph. We give two different arguments which show that the conjecture is false. Given a finite simple graph G, its independence complex IG is defined as the simplicial complex whose vertices are the vertices of G an...
متن کاملHomological dimensions of complexes of R-modules
Let R be an associative ring with identity, C(R) be the category of com-plexes of R-modules and Flat(C(R)) be the class of all at complexes of R-modules. We show that the at cotorsion theory (Flat(C(R)); Flat(C(R))−)have enough injectives in C(R). As an application, we prove that for each atcomplex F and each complex Y of R-modules, Exti (F,X)= 0, whenever Ris n-perfect and i > n.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Random Struct. Algorithms
دوره 34 شماره
صفحات -
تاریخ انتشار 2009